Speeding up Dynamic Programming
نویسندگان
چکیده
A number of important computational problems in molecular biology, geology, speech recognition, and other areas, can be expressed as recurrences which have typically been solved with dynamic programming. By using more sophisticated data structures, and by taking advantage of further structure from the applications, we speed up the computation of several of these recurrences by one or two orders of magnitude. Our algorithms are simple and practical.
منابع مشابه
Speeding up Training with Tree Kernels for Node Relation Labeling
We present a method for speeding up the calculation of tree kernels during training. The calculation of tree kernels is still heavy even with efficient dynamic programming (DP) procedures. Our method maps trees into a small feature space where the inner product, which can be calculated much faster, yields the same value as the tree kernel for most tree pairs. The training is sped up by using th...
متن کاملSpeeding Up Dynamic Programming without Omitting any Optimal Solution and Some Applications in Molecular Biology
We extend the algorithm of Galil and Giancarlo, which speeds up dynamic programming in the case of concave cost functions, such that a compact representation of all optimal solutions is computed. Compared to the Galil-Giancarlo algorithm our time bound grows only by a small constant factor. With a compact representation, we develop eecient algorithms for the solution of problems in molecular bi...
متن کاملMachine Translation as Lexicalized Parsing with Hooks
We adapt the “hook” trick for speeding up bilexical parsing to the decoding problem for machine translation models that are based on combining a synchronous context free grammar as the translation model with an n-gram language model. This dynamic programming technique yields lower complexity algorithms than have previously been described for an important class of translation models.
متن کاملSpeeding up Stochastic Dynamic Programming with Zero-Delay Convolution
We show how a technique from signal processing known as zero-delay convolution can be used to develop more efficient dynamic programming algorithms for a broad class of stochastic optimization problems. This class includes several variants of discrete stochastic shortest path, scheduling, and knapsack problems, all of which involve making a series of decisions over time that have stochastic con...
متن کاملSpeeding Up Exact Dynamic Programming for Series Line Optimization
Dynamic programming value iteration can be made more ef cient on speci c networks by characterizing the transient and insensitive states. These methods are demonstrated by nding the optimal policy for a ve-machine series make-to-stock line with machine failures. State space truncations are chosen by checking the recurrent class in previous runs. An approximate model is developed that reduces ...
متن کامل